Protein Function Prediction Using Semantic Driven K-Medoids Clustering Algorithm
نویسندگان
چکیده
منابع مشابه
K-Medoids Clustering Technique using Bat Algorithm
Clustering is one of the data analysis methods that are widely used in data mining. In this method, we partitioned the data into different subset which is known as cluster. Cluster analysis is the data reduction toll for classifying a “mountain‟ of information into manageable meaningful piles. This method is vast research area in the field of data mining. In this paper, a partitioning clusterin...
متن کاملDocument Clustering using K-Medoids
People are always in search of matters for which they are prone to use internet, but again it has huge assemblage of data due to which it becomes difficult for the reader to get the most accurate data. To make it easier for people to gather accurate data, similar information has to be clustered at one place. There are many algorithms used for clustering of relevant information in one platform. ...
متن کاملColour image segmentation using K – Medoids Clustering
K – medoids clustering is used as a tool for clustering color space based on the distance criterion. This paper presents a color image segmentation method which divides colour space into clusters. Through this paper, using various colour images, we will try to prove that K – Medoids converges to approximate the optimal solution based on this criteria theoretically as well as experimentally. Her...
متن کاملA K-means-like Algorithm for K-medoids Clustering
Clustering analysis is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. This paper proposes a new algorithm for K-medoids clustering which runs like the K-means algorithm and tests several methods for selecting initial medoids. The proposed algorithm calculates the distance matrix once and uses it for finding new medoids at every i...
متن کاملActive Distance-Based Clustering Using K-Medoids
k-medoids algorithm is a partitional, centroid-based clustering algorithm which uses pairwise distances of data points and tries to directly decompose the dataset with n points into a set of k disjoint clusters. However, k-medoids itself requires all distances between data points that are not so easy to get in many applications. In this paper, we introduce a new method which requires only a sma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Learning and Computing
سال: 2014
ISSN: 2010-3700
DOI: 10.7763/ijmlc.2014.v4.385